<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Jamming: tree/Treap.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">Jamming
   &#160;<span id="projectnumber">0.0.1</span>
   </div>
   <div id="projectbrief">An data structure and algorithm template library for quick C++ programming</div>
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">tree/Treap.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Treap.h</span>
<a name="l00003"></a>00003 <span class="comment"> * This file is part of Jamming</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (C) 2012 - Yi</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Jamming is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00010"></a>00010 <span class="comment"> * (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * Jamming is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00015"></a>00015 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with Jamming. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef __TREAP_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define __TREAP_H__</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span>
<a name="l00025"></a>00025 <span class="preprocessor">#ifdef __USE__BOOST__</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor">#include &lt;boost/random/mersenne_twister.hpp&gt;</span>
<a name="l00027"></a>00027 <span class="preprocessor">#include &lt;boost/random/uniform_int.hpp&gt;</span>
<a name="l00028"></a>00028 <span class="preprocessor">#else</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#include &lt;stdlib.h&gt;</span>
<a name="l00030"></a>00030 <span class="preprocessor">#endif </span>
<a name="l00031"></a>00031 <span class="preprocessor"></span>
<a name="l00032"></a>00032 <span class="preprocessor">#ifdef __DEBUG__</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span><span class="preprocessor">#include &lt;queue&gt;</span>
<a name="l00034"></a>00034 <span class="preprocessor">#include &lt;utility&gt;</span>
<a name="l00035"></a>00035 <span class="preprocessor">#include &lt;iostream&gt;</span>
<a name="l00036"></a>00036 <span class="preprocessor">#endif</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span>
<a name="l00038"></a>00038 <span class="preprocessor">#include &lt;time.h&gt;</span>
<a name="l00039"></a>00039 <span class="keyword">namespace </span>Tree
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041     <span class="keyword">template</span> &lt;<span class="keyword">typename</span> _TypeData&gt;
<a name="l00042"></a><a class="code" href="classTree_1_1Treap.html">00042</a>     <span class="keyword">class </span><a class="code" href="classTree_1_1Treap.html">Treap</a> {
<a name="l00043"></a>00043         <span class="keyword">struct </span>Node {
<a name="l00044"></a>00044             <span class="keywordtype">int</span> weight;
<a name="l00045"></a>00045             _TypeData data;
<a name="l00046"></a>00046             Node* child[2];
<a name="l00047"></a>00047         };
<a name="l00048"></a>00048         <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> LEFT=0,RIGHT=1;
<a name="l00049"></a>00049         Node* myroot;
<a name="l00050"></a>00050 <span class="preprocessor">#ifdef __USE__BOOST__</span>
<a name="l00051"></a>00051 <span class="preprocessor"></span>        boost::mt19937 gen;
<a name="l00052"></a>00052         boost::uniform_int&lt;&gt; dist;
<a name="l00053"></a>00053 <span class="preprocessor">#endif</span>
<a name="l00054"></a>00054 <span class="preprocessor"></span>        <span class="keyword">inline</span> <span class="keywordtype">void</span> rotate(Node* &amp;ptrBaseNode,<span class="keywordtype">int</span> right) {
<a name="l00055"></a>00055 <span class="preprocessor">#if __DEBUG__ &gt; 1</span>
<a name="l00056"></a>00056 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Rotate &quot;</span>&lt;&lt;ptrBaseNode&lt;&lt;<span class="stringliteral">&quot;(&quot;</span>&lt;&lt;ptrBaseNode-&gt;data&lt;&lt;<span class="stringliteral">&quot;) &quot;</span>&lt;&lt;(right?<span class="stringliteral">&quot;right&quot;</span>:<span class="stringliteral">&quot;left&quot;</span>)&lt;&lt;std::endl;
<a name="l00057"></a>00057 <span class="preprocessor">#endif</span>
<a name="l00058"></a>00058 <span class="preprocessor"></span>            Node* ptrNewBase=ptrBaseNode-&gt;child[right];
<a name="l00059"></a>00059             ptrBaseNode-&gt;child[right]=ptrNewBase-&gt;child[!right];
<a name="l00060"></a>00060             ptrNewBase-&gt;child[!right]=ptrBaseNode;
<a name="l00061"></a>00061             <span class="comment">//swap ptrNewBase and ptrBaseNode</span>
<a name="l00062"></a>00062             ptrBaseNode=ptrNewBase;
<a name="l00063"></a>00063         };
<a name="l00064"></a>00064         <span class="keywordtype">void</span> insertTosubtree(Node* &amp;root,_TypeData &amp;data) {
<a name="l00065"></a>00065             <span class="keywordflow">if</span>(!root) { 
<a name="l00066"></a>00066                 Node* newNode= <span class="keyword">new</span> Node;
<a name="l00067"></a>00067                 newNode-&gt;data=data;
<a name="l00068"></a>00068                 newNode-&gt;child[LEFT]=newNode-&gt;child[RIGHT]=NULL;
<a name="l00069"></a>00069 <span class="preprocessor">#ifdef __USE__BOOST__</span>
<a name="l00070"></a>00070 <span class="preprocessor"></span>                newNode-&gt;weight=dist(gen);
<a name="l00071"></a>00071 <span class="preprocessor">#else</span>
<a name="l00072"></a>00072 <span class="preprocessor"></span>                newNode-&gt;weight=rand()*rand();
<a name="l00073"></a>00073 <span class="preprocessor">#endif</span>
<a name="l00074"></a>00074 <span class="preprocessor"></span><span class="preprocessor">#if __DEBUG__ &gt; 1</span>
<a name="l00075"></a>00075 <span class="preprocessor"></span>                std::cout&lt;&lt;<span class="stringliteral">&quot;Insert new node &quot;</span>&lt;&lt;newNode&lt;&lt;<span class="stringliteral">&quot;:&quot;</span>&lt;&lt;data&lt;&lt;<span class="stringliteral">&quot;(&quot;</span>&lt;&lt;newNode-&gt;weight&lt;&lt;<span class="stringliteral">&quot;)&quot;</span>&lt;&lt;std::endl;
<a name="l00076"></a>00076 <span class="preprocessor">#endif</span>
<a name="l00077"></a>00077 <span class="preprocessor"></span>                root=newNode;
<a name="l00078"></a>00078                 <span class="keywordflow">return</span>;
<a name="l00079"></a>00079             }
<a name="l00080"></a>00080             <span class="keywordtype">int</span> isRight=data &gt; root-&gt;data;
<a name="l00081"></a>00081 <span class="preprocessor">#if __DEBUG__ &gt; 1</span>
<a name="l00082"></a>00082 <span class="preprocessor"></span>                std::cout&lt;&lt;<span class="stringliteral">&quot;Insert into &quot;</span>&lt;&lt;(isRight?<span class="stringliteral">&quot;right&quot;</span>:<span class="stringliteral">&quot;left&quot;</span>)&lt;&lt;<span class="stringliteral">&quot; of &quot;</span>&lt;&lt;root&lt;&lt;<span class="stringliteral">&quot;(&quot;</span>&lt;&lt;root-&gt;data&lt;&lt;<span class="stringliteral">&quot;)&quot;</span>&lt;&lt;std::endl;
<a name="l00083"></a>00083 #endif
<a name="l00084"></a>00084             <span class="comment">// if equal ? ---&gt; raise keyExists? important! node with same key prevents balancing.</span>
<a name="l00085"></a>00085             <span class="keywordflow">if</span>( data == root-&gt;data ) <span class="keywordflow">return</span>;
<a name="l00086"></a>00086             insertTosubtree(root-&gt;child[isRight],data);
<a name="l00087"></a>00087             <span class="comment">//maintainance</span>
<a name="l00088"></a>00088 <span class="preprocessor">#if __DEBUG__ &gt; 1</span>
<a name="l00089"></a>00089 <span class="preprocessor"></span>            <span class="keywordflow">if</span>(root-&gt;child[isRight]-&gt;weight &lt; root-&gt;weight) {
<a name="l00090"></a>00090                 print();
<a name="l00091"></a>00091                 rotate(root,isRight);
<a name="l00092"></a>00092                 print();
<a name="l00093"></a>00093             }
<a name="l00094"></a>00094 <span class="preprocessor">#else </span>
<a name="l00095"></a>00095 <span class="preprocessor"></span>            <span class="keywordflow">if</span>(root-&gt;child[isRight]-&gt;weight &lt; root-&gt;weight) rotate(root,isRight);
<a name="l00096"></a>00096 <span class="preprocessor">#endif</span>
<a name="l00097"></a>00097 <span class="preprocessor"></span>        };
<a name="l00098"></a>00098         <span class="keywordtype">void</span> deleteFromTree(Node* &amp;root,_TypeData &amp;data) {
<a name="l00099"></a>00099                 <span class="keywordflow">if</span>(root==NULL) <span class="keywordflow">return</span>;
<a name="l00100"></a>00100                     <span class="keywordflow">if</span>(root-&gt;data==data) {
<a name="l00101"></a>00101                                 <span class="keywordtype">bool</span> isRight;
<a name="l00102"></a>00102                                 <span class="keywordflow">if</span>(!root-&gt;child[RIGHT]) { 
<a name="l00103"></a>00103                                     isRight=1;
<a name="l00104"></a>00104                                 } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(!root-&gt;child[LEFT]) {
<a name="l00105"></a>00105                                     isRight=0;
<a name="l00106"></a>00106                                 } <span class="keywordflow">else</span> isRight=root-&gt;child[RIGHT]-&gt;weight&lt;root-&gt;child[LEFT]-&gt;weight;
<a name="l00107"></a>00107                                 <span class="keywordflow">if</span>(root-&gt;child[RIGHT]==NULL&amp;&amp;root-&gt;child[LEFT]==NULL)
<a name="l00108"></a>00108                                 {
<a name="l00109"></a>00109 <span class="preprocessor">#if __DEBUG__ &gt; 1</span>
<a name="l00110"></a>00110 <span class="preprocessor"></span>                                std::cout&lt;&lt;<span class="stringliteral">&quot;Delete node &quot;</span>&lt;&lt;root&lt;&lt;<span class="stringliteral">&quot;(&quot;</span>&lt;&lt;data&lt;&lt;<span class="stringliteral">&quot;)&quot;</span>&lt;&lt;std::endl;
<a name="l00111"></a>00111 <span class="preprocessor">#endif</span>
<a name="l00112"></a>00112 <span class="preprocessor"></span>                                        <span class="keyword">delete</span> root;
<a name="l00113"></a>00113                                         root=NULL;
<a name="l00114"></a>00114                                         <span class="keywordflow">return</span>;
<a name="l00115"></a>00115                                 }
<a name="l00116"></a>00116                                 rotate(root,!isRight);
<a name="l00117"></a>00117 <span class="preprocessor">                                #if __DEBUG__ &gt; 1</span>
<a name="l00118"></a>00118 <span class="preprocessor"></span>                print();
<a name="l00119"></a>00119 <span class="preprocessor">                                #endif</span>
<a name="l00120"></a>00120 <span class="preprocessor"></span>                                deleteFromTree(root-&gt;child[isRight],data);
<a name="l00121"></a>00121                         } <span class="keywordflow">else</span> {
<a name="l00122"></a>00122                                 <span class="keywordtype">bool</span> isRight=data&gt;root-&gt;data;
<a name="l00123"></a>00123                                 deleteFromTree(root-&gt;child[isRight],data);
<a name="l00124"></a>00124                         }
<a name="l00125"></a>00125         }
<a name="l00126"></a>00126         <span class="keywordtype">void</span> deleteSubtree(Node* &amp;ptrNodeToDelete) {
<a name="l00127"></a>00127             <span class="keywordflow">if</span>(ptrNodeToDelete-&gt;child[LEFT]!=NULL) deleteSubtree(ptrNodeToDelete-&gt;child[LEFT]);
<a name="l00128"></a>00128             <span class="keywordflow">if</span>(ptrNodeToDelete-&gt;child[RIGHT]!=NULL) deleteSubtree(ptrNodeToDelete-&gt;child[RIGHT]);
<a name="l00129"></a>00129 <span class="preprocessor">#if __DEBUG__ &gt; 1</span>
<a name="l00130"></a>00130 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Delete &quot;</span>&lt;&lt;ptrNodeToDelete&lt;&lt;<span class="stringliteral">&quot;:&quot;</span>&lt;&lt;ptrNodeToDelete-&gt;data&lt;&lt;std::endl;
<a name="l00131"></a>00131 <span class="preprocessor">#endif</span>
<a name="l00132"></a>00132 <span class="preprocessor"></span>            <span class="keywordflow">if</span>(ptrNodeToDelete!=NULL) <span class="keyword">delete</span> (ptrNodeToDelete);
<a name="l00133"></a>00133         };
<a name="l00134"></a>00134         <span class="keyword">public</span>:
<a name="l00135"></a>00135         <a class="code" href="classTree_1_1Treap.html">Treap</a>() {
<a name="l00136"></a>00136         myroot=NULL;
<a name="l00137"></a>00137 <span class="preprocessor">#ifdef __USE__BOOST__</span>
<a name="l00138"></a>00138 <span class="preprocessor"></span>            gen.seed(time(0));
<a name="l00139"></a>00139             dist=boost::uniform_int&lt;&gt;(1,5434432);
<a name="l00140"></a>00140 <span class="preprocessor">#else</span>
<a name="l00141"></a>00141 <span class="preprocessor"></span>            srand(time(0));
<a name="l00142"></a>00142 <span class="preprocessor">#endif</span>
<a name="l00143"></a>00143 <span class="preprocessor"></span>        }
<a name="l00144"></a>00144         ~<a class="code" href="classTree_1_1Treap.html">Treap</a>() {
<a name="l00145"></a>00145 <span class="preprocessor">#ifdef __DEBUG__</span>
<a name="l00146"></a>00146 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Root is: &quot;</span>&lt;&lt;myroot&lt;&lt;std::endl;
<a name="l00147"></a>00147 <span class="preprocessor">#endif</span>
<a name="l00148"></a>00148 <span class="preprocessor"></span>            <span class="keywordflow">if</span>(myroot) deleteSubtree(myroot);
<a name="l00149"></a>00149             <span class="keywordflow">return</span>;
<a name="l00150"></a>00150         }
<a name="l00151"></a>00151         <span class="keywordtype">void</span> insert(_TypeData data) {
<a name="l00152"></a>00152             insertTosubtree(myroot,data);
<a name="l00153"></a>00153         }
<a name="l00154"></a>00154         <span class="keywordtype">void</span> <span class="keyword">remove</span>(_TypeData data) {
<a name="l00155"></a>00155             deleteFromTree(myroot,data);
<a name="l00156"></a>00156         }
<a name="l00157"></a>00157         <span class="keywordtype">void</span> split() {
<a name="l00158"></a>00158             
<a name="l00159"></a>00159         }
<a name="l00160"></a>00160         <span class="keywordtype">void</span> merge() {
<a name="l00161"></a>00161         
<a name="l00162"></a>00162         };
<a name="l00163"></a>00163 <span class="preprocessor">#ifdef __DEBUG__</span>
<a name="l00164"></a>00164 <span class="preprocessor"></span>        <span class="keywordtype">int</span> maxdepth(Node* root) {
<a name="l00165"></a>00165             <span class="keywordflow">if</span>(!root) <span class="keywordflow">return</span> 0;
<a name="l00166"></a>00166             <span class="keywordtype">int</span> left=maxdepth(root-&gt;child[LEFT]);
<a name="l00167"></a>00167             <span class="keywordtype">int</span> right=maxdepth(root-&gt;child[RIGHT]);
<a name="l00168"></a>00168             <span class="keywordflow">return</span> left&gt;right? left+1:right+1;
<a name="l00169"></a>00169         }
<a name="l00170"></a>00170         <span class="keywordtype">int</span> size(Node* root) {
<a name="l00171"></a>00171             <span class="keywordflow">if</span>(!root) <span class="keywordflow">return</span> 0;
<a name="l00172"></a>00172             <span class="keywordflow">return</span> size(root-&gt;child[LEFT])+size(root-&gt;child[RIGHT])+1;
<a name="l00173"></a>00173         }
<a name="l00174"></a>00174         <span class="keywordtype">void</span> flaten(Node* root) {
<a name="l00175"></a>00175             <span class="keywordflow">if</span>(!root) <span class="keywordflow">return</span>;
<a name="l00176"></a>00176             flaten(root-&gt;child[LEFT]);std::cout&lt;&lt;root-&gt;data&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;flaten(root-&gt;child[RIGHT]);
<a name="l00177"></a>00177         }
<a name="l00178"></a>00178         <span class="keywordtype">void</span> print() {
<a name="l00179"></a>00179             <span class="keywordtype">int</span> depth=maxdepth(myroot);
<a name="l00180"></a>00180             std::queue&lt; std::pair&lt;std::pair&lt;int,int&gt;,Node*&gt; &gt; NodesList;
<a name="l00181"></a>00181             Node* ptrNode=myroot;
<a name="l00182"></a>00182             std::pair&lt;std::pair&lt;int,int&gt;,Node*&gt; nodeInfo;
<a name="l00183"></a>00183             <span class="keywordtype">int</span> level=-1,nth=0,last=0;
<a name="l00184"></a>00184             <span class="comment">//If empty</span>
<a name="l00185"></a>00185             <span class="keywordflow">if</span>(!ptrNode) {std::cout&lt;&lt;<span class="stringliteral">&quot;Tree Empty.&quot;</span>&lt;&lt;std::endl;<span class="keywordflow">return</span>;}
<a name="l00186"></a>00186             <span class="keywordflow">else</span> std::cout&lt;&lt;<span class="stringliteral">&quot;Tree: &quot;</span>;
<a name="l00187"></a>00187             NodesList.push(std::make_pair(std::make_pair(level+1,nth),myroot));
<a name="l00188"></a>00188             <span class="keywordflow">while</span>( ! NodesList.empty()) {
<a name="l00189"></a>00189                 nodeInfo=NodesList.front();
<a name="l00190"></a>00190                 NodesList.pop();
<a name="l00191"></a>00191                 <span class="keywordflow">if</span>(nodeInfo.first.first &gt; level) {
<a name="l00192"></a>00192                     <span class="comment">//enter new level</span>
<a name="l00193"></a>00193                     std::cout&lt;&lt;std::endl&lt;&lt;<span class="stringliteral">&quot;Level &quot;</span>&lt;&lt;level+1&lt;&lt;<span class="stringliteral">&quot; : &quot;</span>;
<a name="l00194"></a>00194                     <span class="keywordflow">for</span>(<span class="keyword">register</span> <span class="keywordtype">int</span> i=0;i&lt;(1&lt;&lt;(depth-level-2))-1;i++) std::cout&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;
<a name="l00195"></a>00195                     last=0;
<a name="l00196"></a>00196                 }
<a name="l00197"></a>00197                 level=nodeInfo.first.first;nth=nodeInfo.first.second;ptrNode=nodeInfo.second;
<a name="l00198"></a>00198                 <span class="keywordflow">for</span>(<span class="keyword">register</span> <span class="keywordtype">int</span> i=0;i&lt;((1&lt;&lt;(depth-level)))*(nth-last)-1;i++) std::cout&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;
<a name="l00199"></a>00199                 <span class="keywordflow">if</span>(ptrNode) std::cout&lt;&lt;ptrNode-&gt;data;
<a name="l00200"></a>00200                 <span class="keywordflow">else</span> std::cout&lt;&lt;<span class="stringliteral">&quot;x&quot;</span>;
<a name="l00201"></a>00201                 <span class="comment">//std::cout&lt;&lt;&quot;(&quot;&lt;&lt;ptrNode-&gt;weight&lt;&lt;&quot;)&quot;;</span>
<a name="l00202"></a>00202                 <span class="comment">//std::cout&lt;&lt;&quot;,&quot;&lt;&lt;nth&lt;&lt;&quot;,&quot;&lt;&lt;last;</span>
<a name="l00203"></a>00203                 last=nth;
<a name="l00204"></a>00204                 <span class="keywordflow">if</span>( ptrNode-&gt;child[LEFT]) NodesList.push(std::make_pair(std::make_pair(level+1,2*nth),ptrNode-&gt;child[LEFT]));
<a name="l00205"></a>00205                 <span class="keywordflow">if</span>( ptrNode-&gt;child[RIGHT]) NodesList.push(std::make_pair(std::make_pair(level+1,2*nth+1),ptrNode-&gt;child[RIGHT]));
<a name="l00206"></a>00206             }
<a name="l00207"></a>00207             std::cout&lt;&lt;std::endl;
<a name="l00208"></a>00208         }
<a name="l00209"></a>00209         <span class="keywordtype">void</span> printFlat() {
<a name="l00210"></a>00210            flaten(myroot);
<a name="l00211"></a>00211            std::cout&lt;&lt;std::endl;
<a name="l00212"></a>00212         }
<a name="l00213"></a>00213         <span class="keywordtype">void</span> printDepth() {
<a name="l00214"></a>00214             std::cout&lt;&lt;<span class="stringliteral">&quot;Max Depth: &quot;</span>&lt;&lt;maxdepth(myroot)&lt;&lt;std::endl;
<a name="l00215"></a>00215         }
<a name="l00216"></a>00216 <span class="preprocessor">#endif</span>
<a name="l00217"></a>00217 <span class="preprocessor"></span>    }; <span class="comment">/* End of Treap */</span>
<a name="l00218"></a>00218 }; <span class="comment">/* End of Tree */</span>
<a name="l00219"></a>00219 
<a name="l00220"></a>00220 
<a name="l00221"></a>00221 <span class="preprocessor">#endif </span><span class="comment">/* __TREAP_H__ */</span>
<a name="l00222"></a>00222 
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Typedefs</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sat Jan 26 2013 22:18:27 for Jamming by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>

</body>
</html>
